Linked Data Querying through FCA-based Schema Indexing
نویسندگان
چکیده
The efficiency of SPARQL query evaluation against Linked Open Data may benefit from schema-based indexing. However, many data items come with incomplete schema information or lack schema descriptions entirely. In this position paper, we outline an approach to an indexing of linked data graphs based on schemata induced through Formal Concept Analysis. We show how to map queries onto RDF graphs based on such derived schema information. We sketch next steps for realizing and optimizing the suggested approach.
منابع مشابه
Improving the recall of decentralised linked data querying through implicit knowledge
Aside from crawling, indexing, and querying RDF data centrally, Linked Data principlesallow for processing SPARQL queries on-the-fly by dereferencing URIs. Proposed link-traversalquery approaches for Linked Data have the benefits of up-to-date results and decentralised (i.e.,client-side) execution, but operate on incomplete knowledge available in dereferenced documents,thus affe...
متن کاملQuerying Transaction-Time Databases under Branched Schema Evolution
Transaction-time databases have been proposed for storing and querying the history of a database. While past work concentrated on managing the data evolution assuming a static schema, recent research has considered data changes under a linearly evolving schema. An ordered sequence of schema versions is maintained and the database can restore/query its data under the appropriate past schema. The...
متن کاملQuerying and Ranking XML Documents Based on Data Synopses
There is an increasing interest in recent years for querying and ranking XML documents. In this paper, we present a new framework for querying and ranking schema-less XML documents based on concise summaries of their structural and textual content. We introduce a novel data synopsis structure to summarize the textual content of an XML document for efficient indexing. More importantly, we extend...
متن کاملOn the Sequencing of Tree Structures for XML Indexing
Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answered holistically through subsequence matching. In this paper, we address the problem of query equivalence with respect to this transformation, and we introduce a performance-oriented principle for sequencing tree stru...
متن کاملA Fuzzy Ontology-Based Platform for Flexible Querying
Flexible queries have recently received increasing attention to better characterize the data retrieval. In this paper, a new flexible querying approach using ontological knowledge is proposed. This approach presents an FCA based methodology for building ontologies from scratch then interrogating them intelligently through the fusion of conceptual clustering, fuzzy logic, and FCA. The main contr...
متن کامل